Performance Comparison between Blocking and Non-Blocking Communications for a Three-Dimensional Poisson Problem
نویسندگان
چکیده
The system of linear equations obtained by finite difference discretization of the three-dimensional Poisson problem is solved by a matrix-free parallel implementation of the Jacobi method. After checking the convergence of our implementation, we compare the speed of using blocking MPI_Ssend/MPI_Recv and non-blocking MPI_Isend/MPI_Irecv communications. The comparisons indicate that the non-blocking communications are slightly faster than the blocking ones but show the same speedup and efficiency behavior. The OpenMPI implementation of MPI is used in conjunction with the Portland Group C compiler.
منابع مشابه
A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کاملModeling and Analysis of Vehicles Flow on the Road
Abstract: This study is carried out to describe the behaviour of vehicles flow on the road, in the presence of blocking effects. A non-linear three dimensional system of ordinary differential equations is used to describe vehicles flow on the road. The study classify total vehicles population on the road into three compartments as Free – Slow – Released vehicles. The formulated model is well-po...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملA Comparative Study of the Parallel Performance of the Blocking and Non-Blocking MPI Communication Commands on an Elliptic Test Problem on the Cluster tara
In this report we study the parallel solution of the elliptic test problem of a Poisson equation with homogenous Dirichlet boundary conditions in a two dimensional domain. We use the finite difference method to approximate the governing equations with a system of N linear equations, with N the number of interior grid points in either spatial direction. To parallelize the computation, we distrib...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009